On $(P_5,\bar{P_5})$-sparse graphs and other families
نویسندگان
چکیده
We extend the notion of $P_4$-sparse graphs previously introduced by {\scshape Ho\`ang} by considering $\mathcal{F}$-sparse graphs were $\mathcal{F}$ denotes a finite set of graphs on $p$ vertices. Thus we obtain some results on $(P_5,\bar{P_5})$-sparse graphs already known on $(P_5,\bar{P_5})$-free graphs. Finally we completely describe the structure of $(P_5,\bar{P_5}, bull$)-sparse graphs, it follows that those graphs have bounded clique-width.
منابع مشابه
Seidel complementation on ($P_5$, $House$, $Bull$)-free graphs
We consider the Seidel complementation on ($P_5, \bar{P_5}, Bull)$-free graphs
متن کاملThe coloring problem for $\{P_5,\bar{P_5}\}$-free graphs and $\{P_5,K_p-e\}$-free graphs is polynomial
We show that determining the chromatic number of a {P 5 , P 5 }-free graph or a {P 5 , K p − e}-free graph can be done in polynomial time.
متن کاملOn colouring (2P2, H)-free and (P5, H)-free graphs
The Colouring problem asks whether the vertices of a graph can be coloured with at most $k$ colours for a given integer $k$ in such a way that no two adjacent vertices receive the same colour. A graph is $(H_1,H_2)$-free if it has no induced subgraph isomorphic to $H_1$ or $H_2$. A connected graph $H_1$ is almost classified if Colouring on $(H_1,H_2)$-free graphs is known to be polynomial-time ...
متن کاملPolynomial-time algorithms for minimum weighted colorings of ($P_5, \bar{P}_5$)-free graphs and related graph classes
We design an O(n) algorithm to find a minimum weighted coloring of a (P5, P 5)free graph. Furthermore, the same technique can be used to solve the same problem for several classes of graphs, defined by forbidden induced subgraphs, such as (diamond, co-diamond)-free graphs.
متن کاملOn P5-free Chordal bipartite graphs
A bipartite graph is chordal bipartite if every cycle of length at least 6 has a chord in it. In this paper, we investigate the structure of $P_5$-free chordal bipartite graphs and show that these graphs have a Nested Neighborhood Ordering, a special ordering among its vertices. Further, using this ordering, we present polynomial-time algorithms for classical problems such as Hamiltonian cycle ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0803.2135 شماره
صفحات -
تاریخ انتشار 2008